<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>Jamming: tree/redBlackTree.h Source File</title>

<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />

<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>

</head>
<body>
<div id="top"><!-- do not remove this div! -->


<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  
  
  <td style="padding-left: 0.5em;">
   <div id="projectname">Jamming
   &#160;<span id="projectnumber">0.0.1</span>
   </div>
   <div id="projectbrief">An data structure and algorithm template library for quick C++ programming</div>
  </td>
  
  
  
 </tr>
 </tbody>
</table>
</div>

<!-- Generated by Doxygen 1.7.6.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
    </ul>
  </div>
</div>
<div class="header">
  <div class="headertitle">
<div class="title">tree/redBlackTree.h</div>  </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> * redBlackTree.h</span>
<a name="l00003"></a>00003 <span class="comment"> * This file is part of Jamming</span>
<a name="l00004"></a>00004 <span class="comment"> *</span>
<a name="l00005"></a>00005 <span class="comment"> * Copyright (C) 2012 - Yi</span>
<a name="l00006"></a>00006 <span class="comment"> *</span>
<a name="l00007"></a>00007 <span class="comment"> * Jamming is free software; you can redistribute it and/or modify</span>
<a name="l00008"></a>00008 <span class="comment"> * it under the terms of the GNU General Public License as published by</span>
<a name="l00009"></a>00009 <span class="comment"> * the Free Software Foundation; either version 2 of the License, or</span>
<a name="l00010"></a>00010 <span class="comment"> * (at your option) any later version.</span>
<a name="l00011"></a>00011 <span class="comment"> *</span>
<a name="l00012"></a>00012 <span class="comment"> * Jamming is distributed in the hope that it will be useful,</span>
<a name="l00013"></a>00013 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00014"></a>00014 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span>
<a name="l00015"></a>00015 <span class="comment"> * GNU General Public License for more details.</span>
<a name="l00016"></a>00016 <span class="comment"> *</span>
<a name="l00017"></a>00017 <span class="comment"> * You should have received a copy of the GNU General Public License</span>
<a name="l00018"></a>00018 <span class="comment"> * along with Jamming. If not, see &lt;http://www.gnu.org/licenses/&gt;.</span>
<a name="l00019"></a>00019 <span class="comment"> */</span>
<a name="l00020"></a>00020 
<a name="l00021"></a>00021 
<a name="l00022"></a>00022 <span class="preprocessor">#ifndef __REDBLACKTREE_H__</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span><span class="preprocessor">#define __REDBLACKTREE_H__</span>
<a name="l00024"></a>00024 <span class="preprocessor"></span><span class="preprocessor">#include &lt;cstring&gt;</span>
<a name="l00025"></a>00025 <span class="keyword">namespace </span>Tree
<a name="l00026"></a>00026 {
<a name="l00027"></a>00027     <span class="keyword">template</span> &lt; <span class="keyword">typename</span> _TypeData&gt;
<a name="l00028"></a><a class="code" href="classTree_1_1RBtree.html">00028</a>     <span class="keyword">class </span><a class="code" href="classTree_1_1RBtree.html">RBtree</a> {
<a name="l00029"></a>00029         <span class="keyword">struct </span>Node {
<a name="l00030"></a>00030             _TypeData data;
<a name="l00031"></a>00031             <span class="keywordtype">bool</span> black;
<a name="l00032"></a>00032             Node* left;
<a name="l00033"></a>00033             Node* right;
<a name="l00034"></a>00034         };
<a name="l00035"></a>00035 
<a name="l00036"></a>00036         Node* root;
<a name="l00037"></a>00037         <span class="keyword">inline</span> rightRotate(Node* ptrBaseNode) {
<a name="l00038"></a>00038             Node* newBase=ptrBaseNode-&gt;left;
<a name="l00039"></a>00039             ptrBaseNode-&gt;left=newBase-&gt;left;
<a name="l00040"></a>00040             newBase-&gt;left=ptrBaseNode-&gt;right;
<a name="l00041"></a>00041             ptrBaseNode-&gt;right=ptrBaseNode;
<a name="l00042"></a>00042             _TypeData tmp;
<a name="l00043"></a>00043             <span class="keywordtype">bool</span> tmpcolor;
<a name="l00044"></a>00044             tmp=newBase-&gt;left-&gt;data;newBase-&gt;left-&gt;data=newBase-&gt;right-&gt;data;newBase-&gt;right-&gt;data=tmp;
<a name="l00045"></a>00045             tmp=ptrBaseNode-&gt;data;newBase-&gt;data=ptrBaseNode-&gt;data;ptrBaseNode-&gt;data=tmp;
<a name="l00046"></a>00046             tmpcolor=newBase-&gt;left-&gt;black;newBase-&gt;left-&gt;black=newBase-&gt;right-&gt;black;newBase-&gt;right-&gt;black=tmpcolor;
<a name="l00047"></a>00047             tmpcolor=ptrBaseNode-&gt;black;newBase-&gt;black=ptrBaseNode-&gt;black;ptrBaseNode-&gt;black=tmpcolor;
<a name="l00048"></a>00048         };
<a name="l00049"></a>00049         <span class="keyword">inline</span> leftRotate(Node* ptrBaseNode) {
<a name="l00050"></a>00050             Node* newBase=ptrBaseNode-&gt;right;
<a name="l00051"></a>00051             ptrBaseNode-&gt;right=newBase-&gt;right;
<a name="l00052"></a>00052             newBase-&gt;right=ptrBaseNode-&gt;left;
<a name="l00053"></a>00053             ptrBaseNode-&gt;left=ptrBaseNode;
<a name="l00054"></a>00054             _TypeData tmp;
<a name="l00055"></a>00055             <span class="keywordtype">bool</span> tmpcolor;
<a name="l00056"></a>00056             tmp=newBase-&gt;left-&gt;data;newBase-&gt;left-&gt;data=newBase-&gt;right-&gt;data;newBase-&gt;right-&gt;data=tmp;
<a name="l00057"></a>00057             tmp=ptrBaseNode-&gt;data;newBase-&gt;data=ptrBaseNode-&gt;data;ptrBaseNode-&gt;data=tmp;
<a name="l00058"></a>00058             tmpcolor=newBase-&gt;left-&gt;black;newBase-&gt;left-&gt;black=newBase-&gt;right-&gt;black;newBase-&gt;right-&gt;black=tmpcolor;
<a name="l00059"></a>00059             tmpcolor=ptrBaseNode-&gt;black;newBase-&gt;black=ptrBaseNode-&gt;black;ptrBaseNode-&gt;black=tmpcolor;
<a name="l00060"></a>00060         };
<a name="l00061"></a>00061         <span class="keyword">public</span>:
<a name="l00062"></a>00062         insert(_TypeData data) {
<a name="l00063"></a>00063             Node* ptrNode=root;
<a name="l00064"></a>00064             Node* ptrParent,ptrGrandparent,ptrUncle;
<a name="l00065"></a>00065             Node* ptrUpperNode,ptrLowerNode;
<a name="l00066"></a>00066             <span class="keywordtype">bool</span> isLeft;
<a name="l00067"></a>00067             <span class="comment">//find the place to insert</span>
<a name="l00068"></a>00068             <span class="keywordflow">while</span>(!ptrNode) {
<a name="l00069"></a>00069                 <span class="keywordflow">if</span>(data &lt;ptrNode-&gt;data) {
<a name="l00070"></a>00070                     ptrParent=ptrUpperNode=ptrNode;ptrNode=ptrNode-&gt;left;isLeft=<span class="keyword">true</span>;
<a name="l00071"></a>00071                 }
<a name="l00072"></a>00072                 <span class="keywordflow">if</span>(data &gt;ptrNode-&gt;data) {
<a name="l00073"></a>00073                     ptrParent=ptrLowerNode=ptrNode;ptrNode=ptrNode-&gt;right;isLeft=<span class="keyword">false</span>;
<a name="l00074"></a>00074                 }
<a name="l00075"></a>00075                 <span class="keywordflow">if</span>(data == ptrNode-&gt;data) { <span class="keywordflow">return</span>}  <span class="comment">// If multiple map,Same key-&gt; collision handle</span>
<a name="l00076"></a>00076             }
<a name="l00077"></a>00077             <span class="comment">// add new node</span>
<a name="l00078"></a>00078             ptrNode= <span class="keyword">new</span> Node;
<a name="l00079"></a>00079             ptrNode-&gt;data=data;
<a name="l00080"></a>00080             ptrNode-&gt;black=<span class="keyword">false</span>;
<a name="l00081"></a>00081             <span class="comment">//if root is NULL</span>
<a name="l00082"></a>00082             <span class="keywordflow">if</span>(!root) {root=ptrNode;root-&gt;black=<span class="keyword">true</span>;<span class="keywordflow">return</span>;}
<a name="l00083"></a>00083             ptrGrandparent=ptrParent==ptrLowerNode?ptrUpperNode:ptrLowerNode;
<a name="l00084"></a>00084             <span class="keywordflow">if</span>(isLeft) {ptrParent-&gt;left=ptrNode;}
<a name="l00085"></a>00085             <span class="keywordflow">else</span> ptrParent-&gt;right=ptrNode;
<a name="l00086"></a>00086             <span class="comment">// case 0: if no grandparent</span>
<a name="l00087"></a>00087             <span class="keywordflow">if</span>(!ptrGrandparent) <span class="keywordflow">return</span>;
<a name="l00088"></a>00088             ptrUncle=ptrParent==ptrGrandparent-&gt;left?ptrGrandparent-&gt;right:ptrGrandparent-&gt;left;
<a name="l00089"></a>00089             <span class="comment">// case 1: uncle is red </span>
<a name="l00090"></a>00090             <span class="keywordflow">if</span>(ptrUncle&amp;&amp;!ptrUncle-&gt;black) {ptrGrandparent-&gt;black=<span class="keyword">false</span>;ptrUncle-&gt;black=ptrParent-&gt;black=<span class="keyword">true</span>;} 
<a name="l00091"></a>00091             <span class="keywordflow">else</span> <span class="keywordflow">if</span>(isLeft) {
<a name="l00092"></a>00092             <span class="comment">// case 2: uncle is black. Node is left child. Right-rotate</span>
<a name="l00093"></a>00093                 rightRotate(ptrGrandparent);
<a name="l00094"></a>00094             } <span class="keywordflow">else</span> {
<a name="l00095"></a>00095             <span class="comment">// case 3: uncle is black.is right child. Left rotate</span>
<a name="l00096"></a>00096                 leftRotate(ptrGrandparent);
<a name="l00097"></a>00097             }
<a name="l00098"></a>00098         };
<a name="l00099"></a>00099         <span class="keyword">remove</span>(_TypeData data) {
<a name="l00100"></a>00100             Node* ptrNode=root;
<a name="l00101"></a>00101             Node* ptrParent,ptrGrandparent,ptrUncle;
<a name="l00102"></a>00102             Node* ptrUpperNode,ptrLowerNode,ptrToReomve;
<a name="l00103"></a>00103             <span class="keywordtype">bool</span> isLeft;
<a name="l00104"></a>00104             <span class="comment">//find the place to insert</span>
<a name="l00105"></a>00105             <span class="keywordflow">while</span>(!ptrNode) {
<a name="l00106"></a>00106                 <span class="keywordflow">if</span>(data &lt;ptrNode-&gt;data) {
<a name="l00107"></a>00107                     ptrParent=ptrUpperNode=ptrNode;ptrNode=ptrNode-&gt;left;isLeft=<span class="keyword">true</span>;
<a name="l00108"></a>00108                 }
<a name="l00109"></a>00109                 <span class="keywordflow">if</span>(data &gt;ptrNode-&gt;data) {
<a name="l00110"></a>00110                     ptrParent=ptrLowerNode=ptrNode;ptrNode=ptrNode-&gt;right;isLeft=<span class="keyword">false</span>;
<a name="l00111"></a>00111                 }
<a name="l00112"></a>00112                 <span class="keywordflow">if</span>(data == ptrNode-&gt;data) ptrToReomve=ptrNode;  
<a name="l00113"></a>00113             }
<a name="l00114"></a>00114             <span class="keywordflow">if</span>(!ptrToReomve) <span class="keyword">raise</span> keyNotExist(); <span class="comment">//not found, nothing to be deleted.</span>
<a name="l00115"></a>00115             <span class="comment">//If multiple map, reduce count but do not delete the node.</span>
<a name="l00116"></a>00116             <span class="comment">//no child</span>
<a name="l00117"></a>00117             <span class="keywordflow">if</span>(!ptrToReomve-&gt;left&amp;&amp;!ptrToReomve-&gt;right) { ptrParent=NULL;<span class="keyword">delete</span> ptrToReomve;<span class="keywordflow">return</span>;}
<a name="l00118"></a>00118             <span class="comment">//one child</span>
<a name="l00119"></a>00119             <span class="keywordflow">if</span>(!ptrToReomve-&gt;left) { ptrToReomve-&gt;data=ptrToReomve-&gt;right;<span class="keyword">delete</span> ptrToReomve-&gt;right; <span class="keywordflow">return</span>;}
<a name="l00120"></a>00120             <span class="keywordflow">if</span>(!ptrToReomve-&gt;right) { ptrToReomve-&gt;data=ptrToReomve-&gt;left;<span class="keyword">delete</span> ptrToReomve-&gt;left; <span class="keywordflow">return</span>;}
<a name="l00121"></a>00121             <span class="comment">//two child</span>
<a name="l00122"></a>00122             ptrToReomve-&gt;data=ptrUpperNode-&gt;data;
<a name="l00123"></a>00123         };
<a name="l00124"></a>00124         Node* find(_TypeData data){
<a name="l00125"></a>00125             Node* ptrNode=root;
<a name="l00126"></a>00126             <span class="keywordflow">while</span>(!ptrNode) {
<a name="l00127"></a>00127                 <span class="keywordflow">if</span>(data &lt;ptrNode-&gt;data) ptrNode=ptrNode-&gt;left;
<a name="l00128"></a>00128                 <span class="keywordflow">if</span>(data &gt;ptrNode-&gt;data) ptrNode=ptrNode-&gt;right;
<a name="l00129"></a>00129                 <span class="keywordflow">if</span>(data == ptrNode-&gt;data) <span class="keywordflow">return</span> ptrNode;
<a name="l00130"></a>00130             }
<a name="l00131"></a>00131             <span class="keywordflow">return</span> NULL;
<a name="l00132"></a>00132         };
<a name="l00133"></a>00133         Node* lower_bound(_TypeData data) {
<a name="l00134"></a>00134             Node* ptrNode=root;
<a name="l00135"></a>00135             Node* ptrLowerNode,ptrUpperNode;
<a name="l00136"></a>00136             <span class="keywordflow">while</span>(!ptrNode) {
<a name="l00137"></a>00137                 <span class="keywordflow">if</span>(data &lt;ptrNode-&gt;data) {ptrUpperNode=ptrNode;ptrNode=ptrNode-&gt;left;}
<a name="l00138"></a>00138                 <span class="keywordflow">if</span>(data &gt;ptrNode-&gt;data) {ptrLowerNode=ptrNode;ptrNode=ptrNode-&gt;right;}
<a name="l00139"></a>00139             }
<a name="l00140"></a>00140             <span class="keywordflow">return</span> ptrLowerNode;
<a name="l00141"></a>00141         };
<a name="l00142"></a>00142         Node* upper_bound(_TypeData data){
<a name="l00143"></a>00143             Node* ptrNode=root;
<a name="l00144"></a>00144             Node* ptrLowerNode,ptrUpperNode;
<a name="l00145"></a>00145             <span class="keywordflow">while</span>(!ptrNode) {
<a name="l00146"></a>00146                 <span class="keywordflow">if</span>(data &lt;ptrNode-&gt;data) {ptrUpperNode=ptrNode;ptrNode=ptrNode-&gt;left;}
<a name="l00147"></a>00147                 <span class="keywordflow">if</span>(data &gt;ptrNode-&gt;data) {ptrLowerNode=ptrNode;ptrNode=ptrNode-&gt;right;}
<a name="l00148"></a>00148             }
<a name="l00149"></a>00149             <span class="keywordflow">return</span> ptrUpperNode;
<a name="l00150"></a>00150         };
<a name="l00151"></a>00151         merge_in(Node* treeRoot);
<a name="l00152"></a>00152         <span class="comment">//TODO set operation: union,difference,common. This is not quite efficient in RB-Tree.</span>
<a name="l00153"></a>00153         <span class="comment">// consider Treap,splay tree. </span>
<a name="l00154"></a>00154         _TypeData min(){
<a name="l00155"></a>00155             Node* node=root;
<a name="l00156"></a>00156             <span class="keywordflow">if</span>(!root) <span class="keyword">raise</span> notInitialized(); 
<a name="l00157"></a>00157             <span class="keywordflow">while</span>(!node-&gt;left) node=node-&gt;left;
<a name="l00158"></a>00158             <span class="keywordflow">return</span> node-&gt;data;
<a name="l00159"></a>00159         };
<a name="l00160"></a>00160         _TypeData max(){
<a name="l00161"></a>00161             Node* node=root;
<a name="l00162"></a>00162             <span class="keywordflow">if</span>(!root) <span class="keyword">raise</span> notInitialized(); 
<a name="l00163"></a>00163             <span class="keywordflow">while</span>(!node-&gt;right) node=node-&gt;right;
<a name="l00164"></a>00164             <span class="keywordflow">return</span> node-&gt;data;
<a name="l00165"></a>00165         };
<a name="l00166"></a>00166     };
<a name="l00167"></a>00167 };
<a name="l00168"></a>00168 
<a name="l00169"></a>00169 
<a name="l00170"></a>00170 <span class="preprocessor">#endif </span><span class="comment">/* __REDBLACKTREE_H__ */</span>
<a name="l00171"></a>00171 
</pre></div></div><!-- contents -->
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Typedefs</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>



<hr class="footer"/><address class="footer"><small>
Generated on Sat Jan 26 2013 22:18:27 for Jamming by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.7.6.1
</small></address>

</body>
</html>
